Perfect Bases for Equational Theories
نویسندگان
چکیده
Perfect bases for equational theories are closely related to confluent and finitely terminating term rewrite systems. The two classes have a large overlap, but neither contains the other. The class of perfect bases is recursive. We also investigate a common generalization of both concepts; we call these more general bases normal, and touch the question of their uniqueness. We also give numerous examples.
منابع مشابه
On Some Varieties of MTL-algebras
The study of perfect, local and bipartite IMTL-algebras presented in [29] is generalized in this paper to the general non-involutive case, i. e. to MTL-algebras. To this end we describe the radical of MTL-algebras and characterize perfect MTL-algebras as those for which the quotient by the radical is isomorphic to the two-element Boolean algebra, and a special class of bipartite MTL-algebras, B...
متن کاملEquational Bases and Nonmodular Lattice Varieties ( ! )
This paper is focused on equational theories and equationally defined varieties of lattices which are not assumed to be modular. It contains both an elementary introduction to the subject and a survey of open problems and recent work. The concept of a "splitting" of the lattice of lattice theories is defined here for the first time in print. These splittings are shown to correspond bi-uniquely ...
متن کاملUni cation in Extensions of Shallow Equational Theories
We show that uni cation in certain extensions of shallow equational theories is decidable Our extensions generalize the known classes of shallow or standard equational theories In order to prove de cidability of uni cation in the extensions a class of Horn clause sets called sorted shallow equational theories is introduced This class is a natural extension of tree automata with equality constra...
متن کاملUniication in Extensions of Shallow Equational Theories
We show that uniication in certain extensions of shallow equational theories is decidable. Our extensions generalize the known classes of shallow or standard equational theories. In order to prove de-cidability of uniication in the extensions, a class of Horn clause sets called sorted shallow equational theories is introduced. This class is a natural extension of tree automata with equality con...
متن کاملMinimum bases for equational theories of groups and rings: the work of Alfred Tarski and Thomas Green
Suppose that T is an equational theory of groups or of rings. If T is finitely axiomatizable, then there is a least number μ so that T can be axiomatized by μ equations. This μ can depend on the operation symbols that occur in T . In the 1960’s, Alfred Tarski and Thomas C. Green completely determined the values of μ for arbitrary equational theories of groups and of rings. While Tarski and Gree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 19 شماره
صفحات -
تاریخ انتشار 1995